Packing of convex polytopes into a parallelepiped
نویسندگان
چکیده
This paper deals with the problem of packing convex polytopes into a parallelepiped of minimal height. It is assumed that the polytopes are oriented, i. e. rotations are not permitted. A mathematical model of the problem is developed and peculiarities of them are addressed. Based on these peculiarities a method to compute local optimal solutions is constructed. Both an approximate and an exact method to search for local minima of the problem are discussed. The exact method is a special modification of the duel simplex method. Some examples are also given.
منابع مشابه
Packing non - convex polytopes into a parallelepiped
The paper considers the problem of packing non-convex polytopes of arbitrary spatial shapes into a parallelepiped of minimal height. The polytopes are oriented, rotation is not permitted. A mathematical model of the problem is developed and some of its peculiarities are analyzed. Due to these peculiarities a solution method is proposed which is based on a meta-heuristic to find some approximati...
متن کاملInstitute for Mathematical Physics Densest Lattice Packings of 3{polytopes Densest Lattice Packings of 3{polytopes
Based on Minkowski's work on critical lattices of 3-dimensional convex bodies we present an eecient algorithm for computing the density of a densest lattice packing of an arbitrary 3-polytope. As an application we calculate densest lattice packings of all regular and Archimedean polytopes.
متن کاملConvex and Combinatorial Geometry Fest
Karoly Bezdek and Egon Schulte are two geometers who have made important and numerous contributions to Discrete Geometry. Both have trained many young mathematicians and have actively encouraged the development of the area by professors of various countries. Karoly Bezdek studied the illumination problem among many other problems about packing and covering of convex bodies. More recently he has...
متن کاملDensest lattice packings of 3-polytopes
Based on Minkowski’s work on critical lattices of 3-dimensional convex bodies we present an efficient algorithm for computing the density of a densest lattice packing of an arbitrary 3-polytope. As an application we calculate densest lattice packings of all regular and Archimedean polytopes.
متن کاملAffine maps between quadratic assignment polytopes and subgraph isomorphism polytopes
We consider two polytopes. The quadratic assignment polytope QAP(n) is the convex hull of the set of tensors x⊗x, x ∈ Pn, where Pn is the set of n×n permutation matrices. The second polytope is defined as follows. For every permutation of vertices of the complete graph Kn we consider appropriate (n 2 ) × (n 2 ) permutation matrix of the edges of Kn. The Young polytope P ((n − 2, 2)) is the conv...
متن کامل